Fast Normalized Cross-Correlation
نویسنده
چکیده
Although it is well known that cross correlation can be efficiently implemented in the transform domain, the normalized form of cross correlation preferred for feature matching applications does not have a simple frequency domain expression. Normalized cross correlation has been computed in the spatial domain for this reason. This short paper shows that unnormalized cross correlation can be efficiently normalized using precomputing integrals of the image and image over the search window.
منابع مشابه
Fast Template Matching
Although it is well known that cross correlation can be efficiently implemented in the transform domain, the normalized form of cross correlation preferred for template matching applications does not have a simple frequency domain expression. Normalized cross correlation is usually computed in the spatial domain for this reason. This short paper shows that unnormalized cross correlation can be ...
متن کاملA Fast Normalized Cross Correlation-Based Block Matching Algorithm Using Multilevel Cauchy-Schwartz Inequality
© 2011 Byung Cheol Song 401 This paper presents a fast block-matching algorithm based on the normalized cross-correlation, where the elimination order is determined based on the gradient magnitudes of subblocks in the current macroblock. Multilevel Cauchy-Schwartz inequality is derived to skip unnecessary block-matching calculations in the proposed algorithm. Also, additional complexity reducti...
متن کاملFast normalized cross correlation for defect detection
Normalized cross correlation has been used extensively for many machine vision applications, but the traditional normalized correlation operation does not meet speed requirements for time-critical applications. In this paper, we propose a fast normalized cross correlation computation for defect detection application. A sum-table scheme is utilized, which allows the calculations of image mean, i...
متن کاملTemplate Matching using Fast Normalized Cross Correlation
In this paper we present an algorithm for fast calculation of the normalized cross correlation NCC and its applica tion to the problem of template matching Given a template t whose position is to be determined in an image f the basic idea of the algorithm is to represent the template for which the normalized cross correlation is calculated as a sum of rectangular basis functions Then the correl...
متن کاملThe fast normalized cross-correlation double-talk detector
In this paper, we present a method for handling double-talk. This approach uses a robust fast recursive least-squares algorithm (FRLS) and the normalized cross-correlation double-talk detector (NCC DTD). The NCC DTD is developed into a fast version, called FNCC, by reusing computational results from the FRLS algorithm. The major advantage of this detector is that it is much less dependent on th...
متن کامل